Domination, discretization, and scalarization
نویسندگان
چکیده
منابع مشابه
Domination, Discretization, and Scalarization
This is an overview of a few possibilities that are open by model theory in applied mathematics. The most attention is paid to the present state and frontiers of the Cauchy method of majorants, approximation of operator equations with finite-dimensional analogs, and the Lagrange multiplier principle in multiobjective decision making. DOI: 10.1134/S1990478909010116 The union of functional analys...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملOn spontaneous scalarization
Marcelo Salgado, Daniel Sudarsky Instituto de Ciencias Nucleares Universidad Nacional Autónoma de México Apdo. Postal 70-543 México 04510 D.F, México and Ulises Nucamendi Departamento de F́ısica Centro de Investigación y de Estudios Avanzados del I.P.N. A. P. 14-741, México, D. F. 07000, México. Abstract We study in the physical frame the phenomenon of spontaneous scalarization that occurs in sc...
متن کاملSpontaneous Scalarization and Boson Stars
We study spontaneous scalarization in Scalar-Tensor boson stars. We find that scalarization does not occur in stars whose bosons have no self-interaction. We introduce a quartic self-interaction term into the boson Lagrangian and show that when this term is large, scalarization does occur. Strong self-interaction leads to a large value of the compactness (or sensitivity) of the boson star, a ne...
متن کاملAdvanced Scalarization of Array Syntax
One task of all Fortran 90 compilers is to scalarize the array syntax statements of a program into equivalent sequential code. Most compilers require multiple passes over the program source to ensure correctness of this translation, since their analysis algorithms only work on the scalarized form. These same compilers then make additional subsequent passes to perform loop optimizations such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied and Industrial Mathematics
سال: 2009
ISSN: 1990-4789,1990-4797
DOI: 10.1134/s1990478909010116